The time to read the input and initialise the problem = 312 ms
The time to create the LP bound problem = 16 ms
The time to compute the linear programming bound = 78 ms
The linear programming lower bound on the solution is:
x11=1.000000
x12=0.000000
x13=0.000000
x14=0.000000
x15=0.000000
x21=0.457516
x22=0.000000
x23=0.542484
x24=0.000000
x25=0.000000
x31=0.919632
x32=0.000000
x33=0.080368
x34=0.000000
x35=0.000000
x41=0.457516
x42=0.000000
x43=0.542484
x44=0.000000
x45=0.000000
x51=1.000000
x52=0.000000
x53=0.000000
x54=0.000000
x55=0.000000
x61=1.000000
x62=0.000000
x63=0.000000
x64=0.000000
x65=0.000000
x71=1.000000
x72=0.000000
x73=0.000000
x74=0.000000
x75=0.000000
x81=0.457516
x82=0.000000
x83=0.542484
x84=0.000000
x85=0.000000
x91=0.457516
x92=0.000000
x93=0.542484
x94=0.000000
x95=0.000000
x101=0.457516
x102=0.000000
x103=0.542484
x104=0.000000
x105=0.000000
y1=1.000000
y2=0.000000
y3=0.542484
y4=0.000000
y5=0.000000
z1=0.000000
z2=0.285223
z3=0.346847
w11=0.000000
w12=0.000000
w13=0.000000
w14=0.000000
w15=0.000000
w21=0.000000
w22=0.000000
w23=83.000000
w24=0.000000
w25=0.000000
w31=154.000000
w32=0.000000
w33=0.000000
w34=0.000000
w35=0.000000
z=53567.411388
The time to read the LP bound solution = 16 ms
Run time is 1422 ms
